Voronoi regions for binary linear block codes

Voronoi regions for binary linear block codes

The Voronoi regions of a block code govern many aspects of the code’s performance on a Gaussian channel, and they are fundamental instruments in, for example, error probability analysis and soft decision decoding. This paper presents an efficient method to find the boundaries of the Voronoi regions for an arbitrary binary linear block code. Two theoretical results together lead to the Voronoi r...

On the Voronoi Neighbor Ratio for Binary Linear Block Codes

Soft-decision decoding of block codes is regarded as the geometrical problem of identifying the Voronoi region within which a given input vector lies. A measure, called the neighbor ratio, is proposed to characterize how many facets a Voronoi region has. Theory and algorithms are presented to determine the neighbor ratio for binary linear block codes and results are given for several types of c...

Binary Linear Block Codes

A Recursive Log-MAP Algorithm for Binary Linear Block Codes

| An e cient recursive Log-MAP algorithm for binary linear block codes is proposed. This algorithm is devised based on the structural properties of the minimal trellis diagram. Simulation results show that for some well known codes, the proposed algorithm reduces decoding complexity signi cantly compared to the conventional Log-MAP algorithm.

Decoding Error Probability of Binary Linear Block Codes

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and outputsymmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes ...